#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
int n,re=-1,m;
int a[N+1],r[N+1],num[N+1],ans;
bool cmp(int a,int b) { return a<b; }
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(0);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>r[i];
    sort(r+1,r+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        if(re!=r[i])
        {
            a[i]=a[i-1]+1;
            re=r[i];
        }
        else a[i]=a[i-1];
        num[a[i]]++;
    }
    m=a[n];
    ans=num[1];
    for(int i=2;i<=m;i++)
    {
        if(num[i]==ans) continue;
        else if(num[i]>ans) ans=num[i];
        else if(num[i]<ans) continue;
    }
    cout<<ans;

    return 0;
}
